Searching edges in the overlap of two plane graphs

Consider a pair of plane straight-line graphs, whose edges are colored red and blue, respectively, and let n be the total complexity of both graphs. We present a O(n log n)-time O(n)-space technique to preprocess such pair of graphs, that enables efficient searches among the red-blue intersections along edges of one of the graphs. Our technique has a number of applications to geometric problems. This includes: (1) a solution to the batched red-blue search problem [Dehne et al. 2006] in O(n log n) queries to the oracle; (2) an algorithm to compute the maximum vertical distance between a pair of 3D polyhedral terrains one of which is convex in O(n log n) time, where n is the total complexity of both terrains; (3) an algorithm to construct the Hausdorff Voronoi diagram of a family of point clusters in the plane in O((n+m) log^3 n) time and O(n+m) space, where n is the total number of points in all clusters and m is the number of crossings between all clusters; (4) an algorithm to construct the farthest-color Voronoi diagram of the corners of n axis-aligned rectangles in O(n log^2 n) time; (5) an algorithm to solve the stabbing circle problem for n parallel line segments in the plane in optimal O(n log n) time. All these results are new or improve on the best known algorithms.Comment: 22 pages, 6 figure

A Markovian event-based framework for stochastic spiking neural networks

In spiking neural networks, the information is conveyed by the spike times, that depend on the intrinsic dynamics of each neuron, the input they receive and on the connections between neurons. In this article we study the Markovian nature of the sequence of spike times in stochastic neural networks, and in particular the ability to deduce from a spike train the next spike time, and therefore produce a description of the network activity only based on the spike times regardless of the membrane potential process. To study this question in a rigorous manner, we introduce and study an event-based description of networks of noisy integrate-and-fire neurons, i.e. that is based on the computation of the spike times. We show that the firing times of the neurons in the networks constitute a Markov chain, whose transition probability is related to the probability distribution of the interspike interval of the neurons in the network. In the cases where the Markovian model can be developed, the transition probability is explicitly derived in such classical cases of neural networks as the linear integrate-and-fire neuron models with excitatory and inhibitory interactions, for different types of synapses, possibly featuring noisy synaptic integration, transmission delays and absolute and relative refractory period. This covers most of the cases that have been investigated in the event-based description of spiking deterministic neural networks

Clinical, methodology, and patient/carer expert advice in pediatric drug development by conect4children

Many medicines are used “off-label” in children outside the terms of the license. Feasible pediatric clinical trials are a challenge to design. Conect4children (c4c) is an Innovative Medicines Initiative project to set up a pan-European pediatric clinical trial network aiming to facilitate the development of new medicines for children. To optimize pediatric trial development by promoting innovative trial design, c4c set up a European multidisciplinary advice service, including the voice of young patients and families, tailored to industry and academia. A network of experts was established to provide multidisciplinary advice to trial sponsors. Experts were selected to join clinical and innovative methodology expert groups. A patient and public involvement (PPI) database, to include the expert opinion of patients and parents/carers was formed. A stepwise process was developed: (1) sponsors contact c4c, (2) scoping interview takes place, (3) ad hoc advice group formed, (5) advice meeting held, and (6) advice report provided. Feedback on the process was collected. Twenty-four clinical and innovative methodology expert groups (>400 experts) and a PPI database of 135 registrants were established. As of September 30, 2022, 36 advice requests were received, with 25 requests completed. Clinical and methodology experts and PPI representatives participated in several advice requests. Sponsors appreciated the advice quality and the multidisciplinary experts from different countries, including experts not known before. Experts and PPI participants were generally satisfied with the process. The c4c project has shown successful proof of concept for a service that presents a new framework to plan innovative and feasible pediatric trials

First Community-Wide, Comparative Cross-Linking Mass Spectrometry Study

The number of publications in the field of chemical cross-linking combined with mass spectrometry (XL-MS) to derive constraints for protein three-dimensional structure modeling and to probe protein-protein interactions has increased during the last years. As the technique is now becoming routine for in vitro and in vivo applications in proteomics and structural biology there is a pressing need to define protocols as well as data analysis and reporting formats. Such consensus formats should become accepted in the field and be shown to lead to reproducible results. This first, community-based harmonization study on XL-MS is based on the results of 32 groups participating worldwide. The aim of this paper is to summarize the status quo of XL-MS and to compare and evaluate existing cross-linking strategies. Our study therefore builds the framework for establishing best practice guidelines to conduct cross-linking experiments, perform data analysis, and define reporting formats with the ultimate goal of assisting scientists to generate accurate and reproducible XL-MS results

Age oí the so called "Transitional beds" between Permian and Jurassic formations in the Gijón Area (Asturias, NW Spain)

Palynological study of black marls below the Jurassic doldmltic limestones (Gijdn Formation) in the Gijdn Area (Asturias, NW Spain) show them to be of Rhetian (late Triassic) age. It appears that the so-called "transitional beds" (black arid red marls, sandstones and gypsum) between the Jurassic liiihestones and underlying Permian red-beds are in non-sequence with the latte

Stabbing Circles for Sets of Segments in the Plane

Stabbing a set S of n segments in the plane by a line is a well-known problem. In this paper we consider the variation where the stabbing object is a circle instead of a line. We show that the problem is tightly connected to cluster Voronoi diagrams, in particular, the Hausdorff and the farthest-color Voronoi diagram. Based on these diagrams, we provide a method to compute all the combinatorially different stabbing circles for S, and the stabbing circles with maximum and minimum radius. We give conditions under which our method is fast. These conditions are satisfied if the segments in S are parallel, resulting in a Onlog2n) time algorithm. We also observe that the stabbing circle problem for S can be solved in optimal O(n2) time and space by reducing the problem to computing the stabbing planes for a set of segments in 3D.Postprint (published version